A Model of ZF Set Theory Language
نویسنده
چکیده
The articles [5], [6], [3], [4], [1], and [2] provide the terminology and notation for this paper. For simplicity we adopt the following convention: k, n will have the type Nat; D will have the type DOMAIN; a will have the type Any; p, q will have the type FinSequence of NAT. The constant VAR has the type SUBDOMAIN of NAT, and is defined by it = { k : 5 ≤ k }. The following proposition is true (1) VAR = { k : 5 ≤ k }.
منابع مشابه
Models and Satisfiability
The article includes schemes of defining by structural induction, and definitions and theorems related to: the set of variables which have free occurrences in a ZF-formula, the set of all valuations of variables in a model, the set of all valuations which satisfy a ZF-formula in a model, the satisfiability of a ZF-formula in a model by a valuation, the validity of a ZF-formula in a model, the a...
متن کاملOn a Set Theory With Uncertain Membership Relations
We logically model uncertainty by expanding language without changing logical reasoning rules. We expand the language of set theory by adding new predicate symbols, uncertain membership relations ∈+ and ∈−. We define the set theory ZF± as an extension of ZF with new symbols in classical logic. In this system we can represent uncertainty which is naturally represented in the model of 3-valued lo...
متن کاملComparison of Subtheories1
Let ZF denote the Zermelo-Fraenkel set theory and ZFI the theory obtained from it by the addition of an axiom which asserts the existence of at least one inaccessible number. If ZF is consistent then ZFI contains number-theoretic theorems which are not theorems of ZF, e.g. the arithmetical sentence which asserts the consistency of ZF—Con(ZF). Mostowski [4] introduced a sentence of the theory of...
متن کاملPermutations and stratified formulae a preservation theorem
It is shown that the sentences (in the language of Set Theory) preserved by the construction usually used to prove the independence of the axiom of foundation can be characterised syntactically: they are precisely the formulae naturally expressible in the language of simple type theory. The permutation construction that concerns us here is familiar to students of ZF as the technique used in the...
متن کاملModels and Satissability
The article includes schemes of deening by structural induction, and deenitions and theorems related to: the set of variables which have free occurrences in a ZF-formula, the set of all valuations of variables in a model, the set of all valuations which satisfy a ZF-formula in a model, the satissability of a ZF-formula in a model by a valuation, the validity of a ZF-formula in a model, the axio...
متن کاملFormalising Ruby in Isabelle ZF
This paper describes a formalisation of the relation based language Ruby in Zermelo Fraenkel set theory ZF using the Isabelle theorem prover We show how a very small subset of Ruby called Pure Ruby easily can be formalised as a conservative extension of ZF and how many useful structures used in connection with VLSI design can be de ned from Pure Ruby The inductive package of Isabelle is used to...
متن کامل